Some information theoretic optimality criteria for general classification
نویسندگان
چکیده
منابع مشابه
Some Information Theoretic Optimality Criteria for General Classification'
Central to the various purposes for which general classification is practiced is the preservation, or summarizing, of information (Michener, 1963; Sneath, 1957; Sokal, 1962; Farris, 1967; Johnson, 1968; Rogers, 1961; Wirth, Estabrook, and Rogers, 1966). This discussion will present one method in which this fundamental concept can be made more precise and, within that context, suggest possible l...
متن کاملSome Experimental Aspects of Optimality-Theoretic Pragmatics
The article has three main concerns: (i) it gives a concise introduction into optimality-theoretic pragmatics; (ii) it discusses the relation to alternative accounts (relevance theory and Levinson's theory of presumptive meanings); (iii) it reviews recent findings concerning the psychological reality of optimality-theoretic pragmatics and its central part concept – bidirectional optimization. A...
متن کاملInformation - Theoretic Refinement Criteria for Image Synthesis
This work is framed within the context of computer graphics starting out from the intersection of three fields: rendering , information theory , and complexity . Initially, the concept of scene complexity is analysed considering three perspectives from a geometric visibility point of view: complexity at an interior point , complexity of an animation, and complexity of a region. The main focus o...
متن کاملInformation Theoretic Criteria for Community Detection
Many algorithms for finding community structure in graphs search for a partition that maximizes modularity. However, recent work has identified two important limitations of modularity as a community quality criterion: a resolution limit; and a bias towards finding equal-sized communities. Information-theoretic approaches that search for partitions that minimize description length are a recent a...
متن کاملInformation-theoretic Criteria for Unit Selection Synthesis1
In our recent work on concatenative speech synthesis, we have devised an efficient, graph-based search to perform unit selection given symbolic information. By encapsulating concatenation and substitution costs defined at the class level, the graph expands only linearly with respect to corpus size. To date, these costs were manually tuned over pre-specified classes, which was a knowledgeintensi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the International Association for Mathematical Geology
سال: 1971
ISSN: 0020-5958,1573-8868
DOI: 10.1007/bf02045962